Restricted Information from Nonadaptive Queries to NP
نویسندگان
چکیده
منابع مشابه
Restricted Information from Nonadaptive Queries to NP
We investigate classes of sets that can be decided by bounded truth-table reductions to an NP set in which evaluators do not have full access to the answers to the queries but get only restricted information such as the number of queries that are in the oracle set or even just this number modulo m, for some m 2. We also investigate the case in which evaluators are nondeterministic. We show that...
متن کاملModulo Information from Nonadaptive Queries to NP
The classes of languages accepted by nondeterministic polynomial-time Turing machines (NP machines, in short) that have restricted access to an NP oracle|the machines can ask k queries to the NP oracle and the answer they receive is the number of queries in the oracle language modulo a number m 2|are considered. It was shown in HT95] that these classes coincide with an appropriate level of the ...
متن کاملOn Functions Computable with Nonadaptive Queries to NP
We study FP NP k , the class of functions that can be computed with nonadaptive queries to an NP oracle. We show that optimization problems stemming from the known NP complete sets, where the optimum is taken over a polynomially bounded range, are hard for FP NP k. This is related to (and, in some sense, extends) work of Chen and Toda CT91]. In addition, it turns out that these optimization pro...
متن کاملA Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP
We study two properties of a complexity class C—whether there exists a truthtable hard p-selective language for C , and whether polynomially-many nonadaptive queries to C can be answered by making O(logn)-many adaptive queries to C (in symbols, is PF tt PF [O(logn)]). We show that if there exists a NP-hard p-selective set under truth-table reductions, then PFNP tt PFNP[O(logn)]. As a consequenc...
متن کاملComputing Functions with Parallel Queries to NP
The class p 2 of languages polynomial-time truth-table reducible to sets in NP has a wide range of diierent characterizations. We consider several functional versions of p 2 based on these characterizations. We show that in this way the three function classes FL NP log , FP NP log , and FP NP k are obtained. In contrast to the language case the function classes seem to all be diierent. We give ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1996
ISSN: 0890-5401
DOI: 10.1006/inco.1996.0067